Finding Contextual Term from Index of Documents using Apriori Algorithm
نویسندگان
چکیده
منابع مشابه
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the well-known Apriori algorithm, minimum support has to be set very low, producing a large number of trivial frequent itemsets. We propose “Apriori-Inverse”, a method of discovering sporadic rules by ignoring all candidate i...
متن کاملEducational Data Mining using Improved Apriori Algorithm
Educational Data Mining (EDM) is an emerging interdisciplinary research area that deals with the development of methods to explore data originating in an educational context. EDM uses different computational approaches to analyze educational data in order to study educational questions. Different data mining techniques has been applied in this area. One of the most widely used techniques in EDM...
متن کاملMaterialized View Generation Using Apriori Algorithm
Data analysis is an important issue in business world in many respects. Different business organizations have data scientists, knowledge workers to analyze the business patterns and the customer behavior. Scrutinizing the past data to predict the future result has many aspects and understanding the nature of the query is one of them. Business analysts try to do this from a big data set which ma...
متن کاملSignature Segmentation from Machine Printed Documents using Contextual Information
Abstract: Automatic signature segmentation from a printed document is a challenging task due to the nature of handwriting of the signatory, overlapping/touching of signature strokes with printed text, graphics, noise, etc. In this paper we propose an approach towards the problem of signature segmentation. The method first detects the signature blocks and then segments them from the document ima...
متن کاملNovel Query Expansion Technique using Apriori Algorithm
One problem in query reformulation process is to nd an optimal set of terms to add to the old query. In our TREC experiments this year, we propose to use the association rule discovery (especially apriori algorithm) to nd good candidate terms to enhance the query. These candidate terms are automatically derived from collection, added to the original query to build a new one. Experiments conduct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/19200-0833